Bounds for parametric sequence comparison

Bounds for Parametric Sequence Comparison

We consider the problem of computing a global alignment between two or more sequences subject to varying mismatch and indel penalties. We prove a tight 3(n=2 )+O(n log n) bound on the worst-case number of distinct optimum alignments for two sequences of length n as the parameters are varied. This re7nes a O(n) upper bound by Gus7eld et al., answering a question posed by Pevzner and Waterman. Ou...

Inverse Parametric Alignment for Accurate Biological Sequence Comparison

For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. In practice, substitution scores are usually chosen by convention, and gap penalties are often found by trial and error. In contrast, a rigorous way to determine parameter values that are appropriate for aligning biological sequences is by s...

Lower bounds of Copson type for the transpose of matrices on weighted sequence spaces

Lower Bounds of Copson Type for Hausdorff Matrices on Weighted Sequence Spaces

Let = be a non-negative matrix. Denote by the supremum of those , satisfying the following inequality: where , , and also is increasing, non-negative sequence of real numbers. If we used instead of The purpose of this paper is to establish a Hardy type formula for , where is Hausdorff matrix and A similar result is also established for where In particular, we apply o...

Parametric Sequence to Sequence Alignment

This paper presents an approach for establishing correspondences in time and in space between two di erent video sequences of the same dynamic scene recorded by stationary uncalibrated video cameras The method simultaneously estimates both spatial alignment as well as temporal synchronization temporal alignment between the two sequences using all available spatio temporal information Temporal v...